Discrete and Dynamic Optimization Problems in Operation Management
نویسندگان
چکیده
منابع مشابه
Solving Impulsive Control Problems by Discrete-Time Dynamic Optimization Methods
In many classes of continuous-time control problems coming from real world applications, control actions in the shape of jumps at certain instants can be useful to be considered. This technique is called impulsive control. The main idea is to split the continuous-time interval in some stages, performing control actions impulsively just in the instants among the stages, with the dynamic system k...
متن کاملDiscrete Bilevel Optimization Problems
Bilevel programming problems are hierarchical optimization problems in which the feasible set is determined by the set of optimal solutions of a second, parametric optimization problem. In this paper we consider problems where this second problem is a discrete one. We start with addressing the problem of the existence of optimal solutions. Then, an algorithm is proposed solving these problems. ...
متن کاملeconomic optimization and energy consumption in tray dryers
دراین پروژه به بررسی مدل سازی خشک کردن مواد غذایی با استفاده از هوای خشک در خشک کن آزمایشگاهی نوع سینی دار پرداخته شده است. برای آنالیز انتقال رطوبت در طی خشک شدن به طریق جابجایی، یک مدل لایه نازک برای انتقال رطوبت، مبتنی بر معادله نفوذ فیک در نظر گفته شده است که شامل انتقال همزمان جرم و انرژی بین فاز جامد و گاز می باشد. پروفایل دما و رطوبت برای سه نوع ماده غذایی شامل سیب زمینی، سیب و موز در طی...
15 صفحه اولSolving dynamic optimization infeasibility problems
Dynamic real-time optimization (DRTO) systems sometimes fail when solving intrinsic optimization problems. There are situations where the solution is infeasible due to the initial conditions, constraint changes during operation, or even the presence of conflicts on constraint specifications. By using a goal programming approach, this work proposes a method to solve these infeasibilities by refo...
متن کاملContinuous Reformulations of Discrete-Continuous Optimization Problems
This paper treats the solution of nonlinear optimization problems involving discrete decision variables, also known as generalized disjunctive programming (GDP) or mixed-integer nonlinear programming (MINLP) problems, that arise in process engineering. The key idea is to eliminate the discrete decision variables by adding a set of continuous variables and constraints that represent the discrete...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Dynamics in Nature and Society
سال: 2013
ISSN: 1026-0226,1607-887X
DOI: 10.1155/2013/816382